Priority Queues Based on Braun Trees
نویسنده
چکیده
This theory implements priority queues via Braun trees. Insertion and deletion take logarithmic time and preserve the balanced nature of Braun trees.
منابع مشابه
A New Form of Efficient Tree-based Priority Queues for Discrete Event Simulation
A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical ti...
متن کاملGames from Basic Data Structures
In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues, priority queues, sets, linked lists, and binary trees. We describe many rulesets as well as computational and mathematical properties about them. Two of the rulesets, Tower Nim and Myopic Col, are new. We show polyn...
متن کاملBiased Leftist Trees and Modi ed Skip Lists
We propose the weight biased leftist tree as an alternative to traditional leftist trees CRAN for the representation of mergeable priority queues A modi ed version of skip lists PUGH that uses xed size nodes is also proposed Experimental results show our modi ed skip list structure is faster than the original skip list structure for the representation of dictionaries Experimental results compar...
متن کاملPriority Queue Sorting and Labeled Trees
The priority queue discussed in this talk is an abstract data type supporting theoperations INSERT and DELETEMIN, which transforms an input permutation σ oflength n to an output permutation τ . Atkinson and Thiyagarajah [2] proved that suchpairs (σ, τ) are counted by (n + 1)n−1. This is also well known as Cayley’s formulain graph theory, which counts the number of labeled trees ...
متن کاملRank-Sensitive Priority Queues
We introduce the rank-sensitive priority queue — a data structure that always knows the minimum element it contains, for which insertion and deletion take O(log(n/r)) time, with n being the number of elements in the structure, and r being the rank of the element being inserted or deleted (r = 1 for the minimum, r = n for the maximum). We show how several elegant implementations of rank-sensitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014